- Cantor sequence
- Математика: последовательность Кантора
Универсальный англо-русский словарь. Академик.ру. 2011.
Cantor sequence
Смотреть что такое "Cantor sequence" в других словарях:
Cantor's diagonal argument — An illustration of Cantor s diagonal argument for the existence of uncountable sets. The sequence at the bottom cannot occur anywhere in the list of sequences above. Cantor s diagonal argument, also called the diagonalisation argument, the… … Wikipedia
Cantor's first uncountability proof — Georg Cantor s first uncountability proof demonstrates that the set of all real numbers is uncountable. Cantor formulated the proof in December 1873 and published it in 1874 in Crelle s Journal [cite… … Wikipedia
Cantor set — In mathematics, the Cantor set, introduced by German mathematician Georg Cantor in 1883 [Georg Cantor (1883) Über unendliche, lineare Punktmannigfaltigkeiten V [On infinite, linear point manifolds (sets)] , Mathematische Annalen , vol. 21, pages… … Wikipedia
Cantor–Bernstein–Schroeder theorem — In set theory, the Cantor–Bernstein–Schroeder theorem, named after Georg Cantor, Felix Bernstein, and Ernst Schröder, states that, if there exist injective functions f : A → B and g : B → A between the sets A and B , then there exists a bijective … Wikipedia
Cantor space — In mathematics, the term Cantor space is sometimes used to denotethe topological abstraction of the classical Cantor set:A topological space is aCantor space if it is homeomorphic to the Cantor set.The Cantor set itself is of course a Cantor… … Wikipedia
Cantor function — In mathematics, the Cantor function, named after Georg Cantor, is an example of a function that is continuous, but not absolutely continuous. DefinitionThe Cantor function c : [0,1] → [0,1] is defined as follows:#Express x in base 3. If possible … Wikipedia
Sequence — For other uses, see Sequence (disambiguation). In mathematics, a sequence is an ordered list of objects (or events). Like a set, it contains members (also called elements or terms), and the number of terms (possibly infinite) is called the length … Wikipedia
Algorithmically random sequence — Intuitively, an algorithmically random sequence (or random sequence) is an infinite sequence of binary digits that appears random to any algorithm. The definition applies equally well to sequences on any finite set of characters. Random sequences … Wikipedia
Controversy over Cantor's theory — In mathematical logic, the theory of infinite sets was first developed by Georg Cantor. Although this work has found wide acceptance in the mathematics community, it has been criticized in several areas by mathematicians and philosophers. Cantor… … Wikipedia
Smith-Volterra-Cantor set — In mathematics, the Smith Volterra Cantor set (SVC) or the fat Cantor set is an example of a set of points on the real line R that is nowhere dense (in particular it contains no intervals), yet has positive measure. Construction Similar to the… … Wikipedia
Ordinal number — This article is about the mathematical concept. For number words denoting a position in a sequence ( first , second , third , etc.), see Ordinal number (linguistics). Representation of the ordinal numbers up to ωω. Each turn of the spiral… … Wikipedia
